Volker Weispfenning and his group in Passau have had a long interest in computer algebra. In this talk, REDUCE, one of the algebra programs they use, will be discussed. The development of this program began over forty years ago. We shall discuss the design decisions that have influenced its long-term survival, and the way in which the program has evolved with time.

INTRODUCTION Surface relief structures at micro and nanoscales are currently focused in different engineering areas. These structures enable special optical, mechanical or chemical properties of the workpiece surfaces. One example is the riblet surface, on which microgrooves are distributed in flow direction. Compared to smooth surfaces ideal riblet structures have been proven to reduce skin fr...

This paper demonstrates that machine learning is a suitable approach for rapid parser development. From 1000 newly treebanked Korean sentences we generate a deterministic shift-reduce parser. The quality of the treebank, particularly crucial given its small size, is supported by a consistency checker.

Tree-to-string systems have gained significant popularity thanks to their simplicity and efficiency by exploring the source syntax information, but they lack in the target syntax to guarantee the grammaticality of the output. Instead of using complex tree-to-tree models, we integrate a structured language model, a left-to-right shift-reduce parser in specific, into an incremental tree-to-string...

A powerful optimization method is proposed in this study for the minimal dimensional design problem of gearbox. It is a general model that is suitable to use for any series of gear drives system and can extract both dimensional and layout of components-limited optimization design together. The objective function in this study has many local extremes so for avoiding this situation, various const...

This paper presents a system which detects and corrects morpho-syntactic errors in Dutch texts. It includes a spelling corrector and a shift-reduce parser for Augmented Context-free Grammars. The spelling corrector is based on trigram and triphone analysis. The parser is an extension of the well-known Tomita algorithm (Tomita, 1986). The parser interacts with the spelling corrector and handles ...